A Generalized Framework for Lifelong Planning A* Search
نویسندگان
چکیده
Recently, it has been suggested that Lifelong Planning A* (LPA*), an incremental version of A*, might be a good heuristic search-based replanning method for HSP-type planners. LPA* uses consistent heuristics and breaks ties among states with the same f-values in favor of states with smaller g-values. However, HSP-type planners use inconsistent heuristics to trade off plan-execution cost and planning time. In this paper, we therefore develop a general framework that allows one to develop more capable versions of LPA* and its nondeterministic version Minimax LPA*, including versions of LPA* and Minimax LPA* that use inconsistent heuristics and break ties among states with the same f-values in favor of states with larger g-values. We then show experimentally that the new versions of LPA* indeed speed it up on grids and thus promise to provide a good foundation for building heuristic search-based
منابع مشابه
Presenting a Framework for Supporting Life-long Learning in Iranian public libraries and Its validation
Purpose: Since nowadays public libraries are considered lifelong learning centers, these centers must have the required standards and conditions to support lifelong learning in order that they could help society members to achieve their personal and professional learning more effectively. Accordingly, it is necessary to develop and provide a mechanism to support lifelong learning in public libr...
متن کاملRefinement Search as a Unifying Framework for Analyzing Planning Algorithms
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly due to the many different vocabularies within which planning algorithms are usually expressed. In this paper, I show that refinement search provides a unifying framework within which various planning...
متن کاملLifelong Planning A
Heuristic search methods promise to find shortest paths for path-planning problems faster than uninformed search methods. Incremental search methods, on the other hand, promise to find shortest paths for series of similar path-planning problems faster than is possible by solving each path-planning problem from scratch. In this article, we develop Lifelong Planning A* (LPA*), an incremental vers...
متن کاملPlanning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly due to the many different vocabularies within which planning algorithms are usually expressed. In this paper we show that refinement search provides a unifying framework within which various planning...
متن کاملIn search of a curriculum planning model for the development of family's cultural capital and academic success of children
The aim of this research is to search for a model for the curriculum planning of the parents' cultural capital growth and to facilitate the children's Progress in school. The correlation of the parent's cultural capital dimensions with the educational achivement of the students was studied, and an efficient plan for the growth of the family's cultural capital was designed, implemented and evalu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005